高阶微商系统Dirac猜想的一个反例

由扩展正则作用量导出了高阶微商奇异Lagrange量系统的扩展正则Noether恒等式.从广义约束Hamilton系统相空间中对称性分析，给出高阶微商系统Dirac猜想的一个反例. 用正则Noether定理、 正则Noether恒等式和扩展正则Noether恒等式说明在此反例中Dirac猜想失效, 讨论中没有将约束线性化. 关键词： 高阶微商系统 约束Hamilton系统 正则对称性 Dirac猜想     

约束系统量子化中Dirac方法与Faddeev-Jackiw方法的等价性

对约束系统量子化中Dirac方法和 Faddeev-Jackiw方法进行了讨论，并对它们的运动方程、正则量子化的等价性进行证明.找出了两种方法中约束的对应关系. 关键词： Faddeev-Jackiw方法 Dirac方法 约束系统 正则量子化     

Global Optimal Image Reconstruction from Blurred Noisy Data by a Bayesian Approach

In this paper, a procedure is presented which allows the optimal reconstruction of images from blurred noisy data. The procedure relies on a general Bayesian approach, which makes proper use of all the available information. Special attention is devoted to the informative content of the edges; thus, a preprocessing phase is included, with the aim of estimating the jump sizes in the gray level. The optimization phase follows; existence and uniqueness of the solution is secured. The procedure is tested against simple simulated data and real data.     

The Lagrangian Globalization Method for Nonsmooth Constrained Equations

The difficulty suffered in optimization-based algorithms for the solution of nonlinear equations lies in that the traditional methods for solving the optimization problem have been mainly concerned with finding a stationary point or a local minimizer of the underlying optimization problem, which is not necessarily a solution of the equations. One method to overcome this difficulty is the Lagrangian globalization (LG for simplicity) method. This paper extends the LG method to nonsmooth equations with bound constraints. The absolute system of equations is introduced. A so-called Projected Generalized-Gradient Direction (PGGD) is constructed and proved to be a descent direction of the reformulated nonsmooth optimization problem. This projected approach keeps the feasibility of the iterates. The convergence of the new algorithm is established by specializing the PGGD. Numerical tests are given. This author's work was done when she was visiting The Hong Kong Polytechnic University. His work is also supported by the Research Grant Council of Hong Kong.     

Superdegenerate point in FCC phase diagram: CVM and Monte Carlo investigations

We investigate the topology of the phase diagram of binary alloys on the fee lattice with first-neighbor antiferromagnetic interactions around the superdegenerate point, where the L1₀ and L1₂ phases meet. We treat the system as a hard-constraint lattice gas, following a procedure previously described by Lebowitzet al. We perform cluster variation method calculations in theT0 limit and Monte Carlo simulations directly atT=0 K on the ground states of the superdegenerate point. We find that: (i) there is no disordered phase in the neighborhood of this point; (ii) a phase L for which two of the four cubic sublattices have the same average occupancy and each of the two others are different appears between L1₀ and L1₂; (iii) the transition L/L1₂ is of first order.     

Minimum concave cost production system: A further generalization of multi-echelon model

We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n ⁴ m) algorithm for this class of problems.     

The convergence properties of direct methods of energy minimization with respect to linear coefficients in the LCAO-MO-SCF approach

It is shown that in the LCAO-MO-SCF problem, if the molecular orbital orthonormality constraints are introduced in the manner first suggested by Fletcher, then the Hessian of the problem is singular. It is suggested that this singularity may well account for the slow convergence observed using direct energy minimization methods to solve the SCF problem. Ways of avoiding the consequences of this singularity are discussed.     

Convex programs with an additional reverse convex constraint

A method is presented for solving a class of global optimization problems of the form (P): minimizef(x), subject toxD,g(x)0, whereD is a closed convex subset ofR ⁿ andf,g are convex finite functionsR ⁿ . Under suitable stability hypotheses, it is shown that a feasible point is optimal if and only if 0=max{g(x):xD,f(x)f( )}. On the basis of this optimality criterion, the problem is reduced to a sequence of subproblemsQ _k ,k=1, 2, ..., each of which consists in maximizing the convex functiong(x) over some polyhedronS _k . The method is similar to the outer approximation method for maximizing a convex function over a compact convex set.     

Characterization of Titania/Silica Gel by Means of Low-Pressure Nitrogen Adsorption

Adsorbents synthesized by grafting of titania onto mesoporous silica gel surfaces at different temperatures were studied by means of nitrogen adsorption–desorption and water desorption. The pore size distribution f(R_p) of titania/silica gel depends on the titania concentration (C_TiO2) and the temperature of titania synthesis. Nonuniformity of TiO₂ phase is maximal at a low C_TiO2 value (3.2 wt.% anatase deposited at 473 K), and two peaks of the fractal dimension distribution f(D) are observed at such a concentration of titania, but at larger C_TiO2 values, only one f(D) peak is seen. More ordered filling of pores and adsorption sites by nitrogen, reflecting in the shape of adsorption energy distributions f(E) at different pressures of adsorbate, is observed for adsorbent with titania (rutile+anatase) grafted on silica gel at a higher temperature (673 K).     

Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations

We address a novel truck scheduling problem arising in crossdocking logistics, in which inbound trucks carry items (pallets) which must be sorted and loaded onto outbound trucks. We minimize the utilisation of the warehouse by focusing on the synchronisation between the different related trucks. The problem is to assign the trucks to the doors of the warehouse and sequence them, in order to minimize the total time spent in the system by the pallets. We discuss the complexity of the problem, showing that even with a single door the problem is NP-hard in general, and discuss some special cases.